An improved string composition method for sequence comparison
نویسندگان
چکیده
منابع مشابه
An Improved Algorithmic Method for Software Development Effort Estimation
Accurate estimating is one of the most important activities in the field of software project management. Different aspects of software projects must be estimated among which time and effort are of significant importance to efficient project planning. Due to complexity of software projects and lack of information at the early stages of project, reliable effort estimation is a challenging issue. ...
متن کاملAn Improved Construction Method for MIHCs on Cycle Composition Networks
Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generalized recursive circulant graphs, circulant graphs and so on, are shown to belong to the family of cycle composition networks. Recently, various studies about mutually independent hamiltonian cycles, abbreviated as MIHC’s, on interconnection networks are published. In this paper, using an improved ...
متن کاملAn improved HPLC method for determination of colocynthin in colocynth
Background and objectives: Colocynthin is the major active secondary metabolite of colocynth, Citrullus colocynthis (L.) Schrad, which has been used in traditional and ethno medicine of many countries. It could be considered as an active marker for quality control of colocynth and its herbal products. Analysis and standardization of colocynth and its herbal preparations are a critical...
متن کاملAn Improved Algorithmic Method for Software Development Effort Estimation
Accurate estimating is one of the most important activities in the field of software project management. Different aspects of software projects must be estimated among which time and effort are of significant importance to efficient project planning. Due to complexity of software projects and lack of information at the early stages of project, reliable effort estimation is a challenging issue. ...
متن کاملAn Improved Algorithm for Approximate String Matching
Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms . • Work supported in part by NSF Grants CCR-86-05353 and CCR-88-14977 1 Department of Computer Science, Columbia University, New York, NY 10...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2008
ISSN: 1471-2105
DOI: 10.1186/1471-2105-9-s6-s15